منابع مشابه
An Adaptive Parallel Algorithm for Computing Connectivity
Computing connected components in undirected graphs is a fundamental problem in graph analytics. The size of graph data collections continues to grow in many different scientific domains, which motivates the need for high performance distributed memory parallel graph algorithms, especially for large networks that cannot fit into the memory of a single compute node. For a graph G(V,E) with n ver...
متن کاملAn Optimal Parallel Circle-Cover Algorithm
Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with 0( n2) processors and use...
متن کاملAn Optimal Parallel Algorithm for Formula Evaluation
A new approach to Buss’s NC algorithm [Bus87] for evaluation of Boolean formulas is presented. This problem is shown to be complete for NC over AC reductions. This approach is then used to solve the more general problem of evaluating arithmetic formulas using arithmetic circuits.
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملAn optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90019-2